Meta-heuristics algorithm for two-machine no-wait flow-shop scheduling problem with the effects of learning
نویسندگان
چکیده
منابع مشابه
Solving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملTwo Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds
The paper considers a two machine flow shop scheduling problem with no wait in process. The objective is to find the optimal values of machine speeds and to determine the time-optimal schedule. There are two machines, A and B, and a set of n jobs each consisting of two operations. The first operation of each job is to be processed on machine A and the second on machine B. For each feasible sche...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملApproximation Algorithms for the Two-Machine Flow Shop No-Wait Scheduling with a Non-Availability Interval
We study the two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a given time interval. The objective is to minimize the makespan. The problem is known to be NP-hard, and in the case of several non-availability intervals is not approximable within a constant factor. We consider all possible scenarios of handling the operation af...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Uncertain Supply Chain Management
سال: 2019
ISSN: 2291-6822,2291-6830
DOI: 10.5267/j.uscm.2019.5.002